A higher homotopic extension of persistent (co)homology
نویسنده
چکیده
Our objective in this article is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of the (say) simplicial set embedded in Rn induces a multiplicative filtration (which would not be a so harsh hypothesis in our setting) on the dg algebra given by the complex of simplicial cochains, we may use a result by T. Kadeishvili to get a unique (up to noncanonical equivalence) A∞-algebra structure on the complete persistent cohomology of the filtered simplicial (or topological) set. We then provide a construction of a (pseudo)metric on the set of all (generalized) barcodes (that is, of all cohomological degrees) enriched with the A∞-algebra structure stated before, refining the usual bottleneck metric, and which is also independent of the particular A∞-algebra structure chosen (among those equivalent to each other). We think that this distance might deserve some attention for topological data analysis, for it in particular can recognize different linking or foldings patterns, as in the Borromean rings. As an aside, we give a simple proof of a result relating the barcode structure between persistent homology and cohomology. This result was observed in [9] under some restricted assumptions, which we do not suppose. Mathematics subject classification 2010: 16E45, 16W70, 18G55, 55U10, 68U05.
منابع مشابه
Homotopic Hopf-Galois extensions of commutative differential graded algebras
This thesis is concerned with the definition and the study of properties of homotopic Hopf-Galois extensions in the category Ch 0 k of chain complexes over a field k, equipped with its projective model structure. Given a differential graded k-Hopf algebra H of finite type, we define a homotopic H-Hopf-Galois extension to be a morphism ' : B ! A of augmented H-comodule dg-k-algebras, where B is ...
متن کاملThe phom package: User’s manual
The phom package is an R package that computes the persistent homology of geometric datasets. Persistent homology is an algebraic tool that allows one to understand the topological characteristics of a given dataset across all spatial scales. It may be thought of as an extension of clustering to higher-dimensional homological properties. The purpose of this package is to make these tools availa...
متن کاملThe Basic Theory of Persistent Homology
Persistent homology has widespread applications in computer vision and image analysis. This paper first motivates the use of persistent homology as a suitable tool to solve the problem of extracting global topological information from a discrete sample of points. The remainder of this paper develops the mathematical theory behind persistent homology. Persistent homology will be developed as an ...
متن کاملMorse Theory for Filtrations and Efficient Computation of Persistent Homology
We introduce an efficient preprocessing algorithm to reduce the number of cells in a filtered cell complex while preserving its persistent homology groups. The technique is based on an extension of combinatorial Morse theory from complexes to filtrations.
متن کاملA spectral sequence for parallelized persistence
We approach the problem of the computation of persistent homology for large datasets by a divide-and-conquer strategy. Dividing the total space into separate but overlapping components, we are able to limit the total memory residency for any part of the computation, while not degrading the overall complexity much. Locally computed persistence information is then merged from the components and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1412.1871 شماره
صفحات -
تاریخ انتشار 2014